منابع مشابه
Wireless Localization within Orthogonal Polyhedra
In the wireless localization problem, given a polygon P ⊂ R, we have to place guards and fix their angular range such that P can be described using these guards. The guards describe P if for every point pair p ∈ P and q / ∈ P , there is a guard that sees p but does not see q. We consider the analogous problem in 3D: given a polyhedron P ⊂ R, place guards—which now are polyhedral cones—that coll...
متن کاملFundamental Dominations in Graphs
Nine variations of the concept of domination in a simple graph are identified as fundamental domination concepts, and a unified approach is introduced for studying them. For each variation, the minimum cardinality of a subset of dominating elements is the corresponding fundamental domination number. It is observed that, for each nontrivial connected graph, at most five of these nine numbers can...
متن کاملLinking Dominations and Signatures in Network Reliability
Comparing the reliability of two networks of more than modest size can be a computationally intensive exercise. In this paper, domination theory and the notion of the signature of a network, and their respective roles in calculating the reliability of a network, are briefly reviewed. The computational advantages of the former, and the interpretive richness of the latter, beg the question: how a...
متن کاملSymmetry-breaking constraints for packing identical rectangles within polyhedra
Two problems related to packing identical rectangles within a polyhedron are tackled in the present work. Rectangles are allowed to differ only by horizontal or vertical translations and possibly ninety-degree rotations. The first considered problem consists in packing as many identical rectangles as possible within a given polyhedron, while the second problem consists in finding the smallest p...
متن کاملOn Perfect and Quasiperfect Dominations in Graphs∗
A subset S ⊆ V in a graph G = (V,E) is a k-quasiperfect dominating set (for k ≥ 1) if every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k-quasiperfect dominating set in G is denoted by γ 1k (G). Those sets were first introduced by Chellali et al. (2013) as a generalization of the perfect domination concept and allow us to construct a dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2003
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm178-3-1